Vertex Bimagic Total Labeling for Graphs
نویسندگان
چکیده
A vertex magic total labeling on a graph with v vertices and e edges is a one to one map taking the vertices and edges onto the integers with the property that the sum of the label on the vertex and the labels of its incident edges is a constant, independent of the choice of the vertex. A graph with vertex magic total labeling with two constants or is called a vertex bimagic total labeling. The constants and are called magic constants. In this paper we have found that the star graphs for all , cycle when is even, crown graphs , kite graph for odd , wheel graph ,the fan graph admits vertex bimagic total labeling. It has been proved that the star graphs has vertex bimagic total labeling for all , but does not have vertex magic total labeling for . It has also been discussed that the vertex bimagic total labeling of Petersen graphs and when is a multiple of 4, . Also the extremities of bimagic constants in vertex bimagic total labeling graphs has also been discussed in this paper. AMS MSC Classification: 05C78
منابع مشابه
New Constructions of Edge Bimagic Graphs from Magic Graphs
An edge magic total labeling of a graph G(V,E) with p vertices and q edges is a bijection f from the set of vertices and edges to such that for every edge uv in E, f(u) + f(uv) + f(v) is a constant k. If there exist two constants k1 and k2 such that the above sum is either k1 or k2, it is said to be an edge bimagic total labeling. A total edge magic (edge bimagic) graph is called a super edge m...
متن کاملVertex BIMAGIC Total Labeling for BISTAR Bn,n
A vertex bimagic total labeling on a graph with v vertices and e edges is a one to one map taking the vertices and edges onto the integers 1, 2, 3, ...v + e with the property that the sum of the label on the vertex and the labels of its incident edges is one of the constants k1 or k2, independent of the choice of the vertex. In this paper we have discussed that bistar Bn,n are vertex bimagic to...
متن کاملTotal vertex irregularity strength of corona product of some graphs
A vertex irregular total k-labeling of a graph G with vertex set V and edge set E is an assignment of positive integer labels {1, 2, ..., k} to both vertices and edges so that the weights calculated at vertices are distinct. The total vertex irregularity strength of G, denoted by tvs(G)is the minimum value of the largest label k over all such irregular assignment. In this paper, we study the to...
متن کاملVertex Equitable Labeling of Double Alternate Snake Graphs
Let G be a graph with p vertices and q edges and A = {0, 1, 2, . . . , [q/2]}. A vertex labeling f : V (G) → A induces an edge labeling f∗ defined by f∗(uv) = f(u) + f(v) for all edges uv. For a ∈ A, let vf (a) be the number of vertices v with f(v) = a. A graph G is said to be vertex equitable if there exists a vertex labeling f such that for all a and b in A, |vf (a) − vf (b)| ≤ 1 and the indu...
متن کامل$Z_k$-Magic Labeling of Some Families of Graphs
For any non-trivial abelian group A under addition a graph $G$ is said to be $A$-textit{magic} if there exists a labeling $f:E(G) rightarrow A-{0}$ such that, the vertex labeling $f^+$ defined as $f^+(v) = sum f(uv)$ taken over all edges $uv$ incident at $v$ is a constant. An $A$-textit{magic} graph $G$ is said to be $Z_k$-magic graph if the group $A$ is $Z_k$ the group of integers modulo $k...
متن کامل